a hybrid heuristic algorithm to solve capacitated location-routing problem with fuzzy ‎demands‎

Authors

a. ‎nadizadeh‎‎

department ‎of industrial engineering, faculty of engineering, ardakan university, ardakan, ‎iran‎. a. sadegheih

industrial engineering department, faculty of engineering, yazd university, yazd, ‎iran‎. a. sabzevari ‎zadeh‎

industrial engineering department, faculty of engineering, shahed university, tehran, ‎iran.‎

abstract

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of customers with fuzzy demands should be supplied by a fleet of vehicles that start and end their tours at a single depot. moreover, the vehicles and the depots have a limited capacity. to model this problem, a fuzzy chance-constrained programming is designed based on fuzzy credibility theory. to solve the clrp-fd, a hybrid heuristic algorithm (hha) including two main phases is proposed. in the first phase, an initial population of solutions is generated by the greedy clustering method (gcm) obtained from the literature of the problem, while in the second phase, a genetic algorithm is applied for further improvement of the solutions of first phase. while the first phase of the hha consists of four steps, the second phase includes two main steps. to achieve the best value of the major parameter of the model, named dispatcher preference index, and to analyze its influence on the changes of the final solution, numerical experiments with different sizes on the number of customers and candidate depots are carried out. the computational results show that the hha is efficient so that it has improved all solutions that obtained from the gcm. finally, performance of the proposed model to the similar model exists in the literature is evaluated by several standard test problems of the ‎clrp.‎

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy ‎Demands‎

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

full text

A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

full text

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

full text

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

full text

Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

Location-Routing Problem (LRP) is related to logistics system of supply chain. In LRP, aims are facility location problem and vehicle routing problem that are considered simultaneously. As shown in recent researches, the costs in distribution systems may be excessive if routes are ignored when locating depots. In this paper, a heuristic method in four phases is developed to solve Capacitated Lo...

full text

a hybrid meta-heuristic approach for the capacitated location-routing problem with hard time windows

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of industrial mathematics

جلد ۹، شماره ۱، صفحات ۱-۲۱

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023